Перевод: с английского на все языки

со всех языков на английский

non-terminal node

См. также в других словарях:

  • Non-terminal function — A non terminal function is a function (node) in a parse tree which is either a root or a branch in that tree. Background A parse tree is made up of nodes and branches. In the picture below the parse tree is the entire structure, starting from S… …   Wikipedia

  • Terminal Node Controller — TNC de type PK 232, début des années 1990. Un Terminal Node Controller (TNC) est un appareil utilisé par les radioamateurs pour se connecter à des réseaux packet radio AX.25. Cet appareil reprend les fonctions des assembleurs/désassembleurs de… …   Wikipédia en Français

  • Terminal function — A terminal function is a function (node) in a parse tree which is a leaf in that parse tree. Background A parse tree is made up of nodes and branches. In the picture below the parse tree is the entire structure, starting from S and ending in each …   Wikipedia

  • Diskless node — A diskless node (or diskless workstation) is a workstation or personal computer without disk drives, which employs network booting to load its operating system from a server. (A computer may also be said to act as a diskless node, if its disks… …   Wikipedia

  • Hidden node problem — In wireless networking, the hidden node problem occurs when a Node (networking) node is visible from a wireless access point (AP), but not from other nodes communicating with said AP. This leads to difficulties in media access control.… …   Wikipedia

  • Long non-coding RNA — Long noncoding RNAs (long ncRNAs) are generally considered (somewhat arbitrarily) as non protein coding transcripts longer than 200 nucleotides. This limit is due to practical considerations including the separation of RNAs in common experimental …   Wikipedia

  • Network on Terminal Architecture — NoTA Main architecture NoTA Interconnect architecture Network on Terminal …   Wikipedia

  • Extensive-form game — An extensive form game is a specification of a game in game theory. This form represents the game as a tree. Each node (called a decision node) represents every possible state of play of the game as it is played. Play begins at a unique initial… …   Wikipedia

  • extensive form game — noun Informally, a representation of a game as a tree of decision nodes, with the game beginning at a unique initial node, and flowing through the tree along a path determined by the players until a terminal node is reached, where play ends and… …   Wiktionary

  • нетерминальный узел древовидной схемы — неоконечный узел — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом Синонимы неоконечный узел EN non terminal node …   Справочник технического переводчика

  • Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»